A Platform for Combining Deductive with Algorithmic Verification
نویسندگان
چکیده
We describe a computer-aided veriication system which combines deductive with algorithmic (model-checking) veriication methods. The system, called tlv (for temporal veriication system), is constructed as an additional layer superimposed on top of the cmu smv system, and can verify nite-state systems relative to linear temporal logic (ltl) as well as ctl speciications. The systems to be veriied can be either hardware circuits written in the smv design language or nite-state reactive programs written in a simple programming language (spl). The paper presents a common computational model which can support these two types of applications and a high-level interactive language tlv-Basic, in which temporal veriication rules, proofs, and complex assertions can be written. We illustrate the eeciency and generality gained by combining deductive with algorithmic techniques on several examples, culminating in veriication of fragments of the Futurebus+ system. In the analysis of the Futurebus+ system , we even managed to detect a bug that was not discovered in a previous model-checking analysis of this system.
منابع مشابه
Predicate diagrams as basis for the verification of reactive systems
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems. Diagrams integrate deductive and algorithmic verification techniques for the verification of finite and infinite-state systems, thus combining the expressive power and flexibility of deduction with the automation provided by algorithmic methods. Our formal framework for the specification and ve...
متن کاملAn Update on STeP: Deductive-Algorithmic Verification of Reactive Systems
The Stanford Temporal Prover, STeP, is a tool for the computer-aided formal verification of reactive systems, including real-time and hybrid systems, based on their temporal specification. STeP integrates methods for deductive and algorithmic verification, including model checking, theorem proving, automatic invariant generation, abstraction and modular reasoning. We describe the most recent ve...
متن کاملThe Why/Krakatoa/Caduceus Platform for Deductive Program Verification
We present the Why/Krakatoa/Caduceus set of tools for deductive veri cation of Java and C source code.
متن کاملA Deductive Verification Platform for Cryptographic Software
In this paper we describe a deductive verification platform for the CAO language. CAO is a domain-specific language for cryptography. We show that this language presents interesting challenges for formal verification, not only in the rich mathematical type system that it introduces, but also in the cryptography-oriented language constructions that it offers. We describe how we tackle these prob...
متن کاملApproaches to the Formal Verification of Hybrid Systems
Address: see R. Huuck, Tel. +49 431 5604-22, Email: [email protected] This paper presents two different approaches to the problem of formally verifying the correctness of control systems which consist of a logic controller and a continuous plant and, thus, constitute a hybrid system. One approach aims at algorithmic verification and combines Condition/Event Systems with Timed Automata. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996